Search results for "objective functions"
showing 2 items of 2 documents
Greedy and K-Greedy algoritmhs for multidimensional data association
2011
[EN] The multidimensional assignment (MDA) problem is a combinatorial optimization problem arising in many applications, for instance multitarget tracking (MTT). The objective of an MDA problem of dimension $d\in\Bbb{N}$ is to match groups of $d$ objects in such a way that each measurement is associated with at most one track and each track is associated with at most one measurement from each list, optimizing a certain objective function. It is well known that the MDA problem is NP-hard for $d\geq3$. In this paper five new polynomial time heuristics to solve the MDA problem arising in MTT are presented. They are all based on the semi-greedy approach introduced in earlier research. Experimen…
Experimental Research on the Cutting of Metal Materials by Electrical Discharge Machining with Contact Breaking with Metal Band as Transfer Object
2020
The scientific paper presents practical research carried out by a mixed team of Romanian researchers from universities and the business environment. The research consists in applying the process of cutting metallic materials through electrical discharge machining with contact breaking using a metal band as a transfer object. The research was implemented with the help of a specially designed installation in the laboratory and subsequently all the necessary steps were taken to obtain the patent for it. Various metallic materials were cut using this process, but first of all, high alloy steels. In the global research conducted by the authors, active experimental programs and classic experiment…